Randomization, derandomization and antirandomization: three games

Randomization, Derandomization and Antirandomization: Three Games

Spencer, J., Randomization, derandomization and antirandomization: three games. Theoretical Computer Science 131 (1994) 415-429. Three games are given between two players, Paul and Carole, with a common theme. In each round Paul does a split and Carole chooses. Random play by Carole allows a bound for the game value. Through derandomization this becomes a deterministic strategy for Carole minim...

44 Randomization and Derandomization

FRAMEWORK AND ANALYSIS Most randomized incremental algorithms in the literature follow the framework sketched here for the computation of the trapezoidal map: the structure to be computed is maintained while the objects defining it are inserted in random order. To insert a new object, one first has to find a “conflict” of that object (the location step), then local updates in the structure are ...

Randomization and derandomization

Entropy, Randomization, Derandomization, and Discrepancy

The star discrepancy is a measure of how uniformly distributed a finite point set is in the d-dimensional unit cube. It is related to high-dimensional numerical integration of certain function classes as expressed by the Koksma-Hlawka inequality. A sharp version of this inequality states that the worst-case error of approximating the integral of functions from the unit ball of some Sobolev spac...

Lecture IX RANDOMIZATION AND DERANDOMIZATION

Probabilistic thinking turns out to be uncannily effective for proving the existence of combinatorial objects. Such proofs can often be converted into randomized algorithms. There exist efficient randomized algorithms for problems that are not known to have efficient deterministic solutions. Even when both deterministic as well as randomized algorithms are available for a problem, the randomize...